Computer-based right distribution system

ABSTRACT

An automated ticket auctioning system receives and evaluates bid information records received from a plurality of remote terminals. Each bid information record corresponds to at least one bid for one or more desired seats at a venue. Each bid information record may also include a plurality of additional bids identified for different seats in the venue. The separate bids in each bid information record are prioritized. The automated ticket auctioning system includes a central controlling computer operable to receive the bid information records and determine, in order of priority, whether any of the bids in a bid information record is accepted. If one bid in a bid information record is accepted, all lower priority bids in that bid information record are dismissed.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation-in-part of U.S. application Ser. No.09/778,606, filed Feb. 7, 2001, which is a continuation-in-part of U.S.application Ser. No. 09/586,927 filed Jun. 5, 2000 (now U.S. Pat. No.6,704,713), which is a continuation of PCT application Ser. No.PCT/US00/03136 filed Feb. 7, 2000, which is a continuation-in-part ofU.S. application Ser. No. 08/862,547, filed May 23, 1997 (now U.S. Pat.No. 6,023,685), which claims the priority of provisional patentapplication No. 60/018,211, filed May 23, 1996.

BACKGROUND

1. Field

The present invention relates to the field of auctions and, inparticular, networked systems for conducting specialty auctions usingcomputers.

2. Background

An important goal of anyone attempting to sell the right to attend anevent, to own a product, or to perform an activity is to receive inreturn for that right the true market value of the right. For somerights, the market values of similar rights are all equal. For example,under normal conditions, the fair market value of two identical radios,both of the same brand and model, is the same. Thus, if a consumer weregiven the opportunity to purchase the right to obtain one of the radiosinstead of the other, there would typically be no incentive for theconsumer to pay for that right. Therefore, the market value of therights to obtain the radios are equal. However, the relative marketvalues of some rights to similar products, services, or events are notthe same, but are dependent upon a difference in some characteristic ofthe rights. For example, when purchasing tickets to a concert, althougheach of two tickets may allow the holder to see the same performer, onthe same night, in the same venue, the market values of those ticketsdiffer depending upon the location of the ticket within the venue.Therefore, the market value of the right to sit in a particular seat ata concert depends at least in part upon the characteristic of theproximity of the seat to center stage.

The right to perform an activity, or obtain a product, or attend anevent wherein the difference between the market value of the right andthe market value of another similar right is dependent upon thedifference in some characteristic of the rights shall be referred toherein as a “priority right”. A ticket is one example of a priorityright used throughout the specification. However, it is to be understoodthat tickets are not the only priority rights applicable to the presentinvention.

Too often, the established methods of selling priority rights do notresult in prices for these rights that are equal to their true marketvalue. Therefore, these established methods are incapable of maximizingthe revenue of those selling priority rights.

For some priority rights, the manner in which differences in thepertinent characteristic affect the market value of the right areapparent. For instance, for most sports or concert performances, themarket value of the ticket rights, i.e., the right to sit in aparticular seat at a particular event, is greater if the seat is closerto the stage. Thus, it may be relatively easy for a seller to rank theticket rights prior to any sale of the rights. However, for otherpriority rights, although the characteristic that affects the marketvalue of the right may itself be obvious, the manner in which variancein the characteristic affects the market value is not apparent. Forexample, when an individual wishes to purchase the right to play a roundof golf at a particular course, the time that the round begins willlikely affect the amount that the individual is willing to pay. Thegolfer may wish to be the first to tee off and would be willing to paymore for such a time than for any other. On the other hand, the golfermay have another commitment in the morning and be interested only in teetimes in the afternoon. Therefore, the amount the individual would bewilling to pay for a time in the afternoon varies greatly from theamount for a time in the morning. Due to this variability in consumerpreference, any ranking of the rights to play a round of golf atparticular times on a particular day by the owner of the golf course maynot result in sales prices for these rights that are equal to their truemarket values. Therefore, a system is needed whereby the true marketvalues of all priority rights can be achieved, including both thoserights with relative values that can be easily pre-ranked and thoserights with relative market values dependent upon consumer preferencesthat are difficult to discern prior to the commencement of sales.

Types of Priority Rights

As discussed above, the right to sit in a particular seat for aparticular event is a priority right wherein the market value of similarrights can be ranked prior to the sale of the rights, by ordering theseats in large part according to their proximity to center stage. Thecurrent manner of selling the right to sit in a particular seat for aparticular event involves selling tickets to the event. However, theestablished method of selling tickets to sporting and entertainmentevents involves pre-setting inflexible prices and then releasing thetickets for sale at a box office or by phone. This method has a numberof shortcomings. Typically, each sale involves employees takingtime-consuming individual orders and trying to describe the prices andseat locations to customers. Another shortcoming with this method isthat it can be highly inconvenient and sometimes impossible for thepurchaser to access the sale due to demand. This is especially true forpremium or “high demand” events. Moreover, for practical reasons, pricesare assigned to tickets in large blocks, while, in reality, purchasersoften consider tickets within a block to have a wide ranging continuumof values; and these market values can be very hard to estimate beforethe tickets are sold. Largely because of these shortcomings, manypremium tickets are sold for substantially less than their market value.Generally, these shortcomings exist even with new automated methodsinvolving phone or Internet sales since the number of tickets is limitedand the selling system is still fundamentally the same; with“first-come-first-served” orders taken for pre-priced tickets.

Another priority right with a relative market value that can be fairlyeasily determined prior to sale is the right to obtain a product forwhich the market demand far exceeds the supply. Occasionally, amanufacturer underestimates the demand for its product and thus createstoo few units for the product's initial market release. Examples of thisoccurrence in the recent past include the Cabbage Patch Kids™ doll, theTickle-Me Elmo™ doll, and the Sony PlayStation 2™ video game system.When such a situation exists, the manufacturer generally maintains afixed selling price and offers the products on a“first-come-first-served” basis. The manufacturer not only loses revenuefrom the sales it could have made if it had produced more units, but italso loses revenue by selling the units it did produce at a price belowtheir true market value. This difference between the original salesprice and the market value is typically realized by an entity other thanthe manufacturer, e.g. one who buys the product and then resells it at ahigher price. The pertinent characteristic that determines the marketvalue of such highly desired products is the time of availability of theproduct to the consumer. In other words, a consumer would pay more tohave the first product off the assembly line than to have thefive-hundredth. Therefore, a system is needed so that when amanufacturer realizes that it has produced too few of a highly desiredproduct, the manufacturer may maximize its revenue on those products byselling them at their true market value.

Other priority rights with market values that can be ranked prior totheir sale are rights to obtain services wherein the value of thoserights are dependent upon the order in which the services are received.For example, many consumers hire companies or individuals to remove snowfrom their property after an accumulation of snow. However, the value ofthis service is dependent upon the time at which the service isperformed and, therefore, is dependent upon the order in which theproperties are serviced. For instance, a consumer would likely bewilling to pay more to be the first serviced after the accumulation ofsnow has stopped than to be the twentieth to receive the same service.Therefore, a system is needed wherein this discrepancy in market valuemay be realized by the provider of the service.

Another example of a service with a market value dependent upon theorder of its performance is admittance through a toll booth. Currently,the administrator of a toll booth receives a set price for each vehiclethat passes through the toll booth. That price is often dependent uponthe type of vehicle, but the price does not reflect the true marketvalue of the right to pass through the booth. The true market valuedepends upon how quickly the consumer is able to pass through the booth,i.e., the consumer's order in the line at the toll booth. Therefore, asystem is required whereby the price of the right to pass through a tollbooth is dependent upon the order in which the consumer is allowed topass through the toll area.

Another right for which the current sales system does not return thetrue market value of the right is the right to obtain a certain numberedproduct of a limited edition series of products. For example, a popularartist may sell only 100 prints of one of her paintings. The currentestablished method for such sales is offering all of the prints for saleat a set, inflexible price on a “first-come-first-served” basis.However, this sales approach may not achieve the full market value forall of the prints. Many consumers may be willing to pay more for thefirst numbered print than for the fiftieth. Therefore, because only oneprice is set for all of the prints, many of the prints are likely beingsold at a price below their true market value. Also, by basing theavailability of the prints upon “first-come-first-served,” theadditional profit that could be gained by selling a print to one whocomes later but is willing to pay more is lost. Because the lower thenumber on the limited edition item, the higher its value, the relativemarket values of the rights to obtain items with different numbers canbe determined prior to any sales activity. A system is needed wherebythe true market value of limited edition items may be realized by theseller of the items.

Other markets in which the priority rights that are sold are oftenpurchased for less than their market value are those markets containingproducts whose true market value depends on the product's location. Forexample, the rights to stay in cabins on cruise ships or hotel rooms orbungalows in vacation resorts are often assigned a sales price based onthe amenities available in the room. However, among rooms containing thesame amenities, the true market value of the right to stay in each roommay differ depending upon the distance from the room to some desiredlocation, such as a pool, beach, or lounge. The established method fordetermining the price of the right to stay in such rooms is to simplyset a fixed price and make the rooms available on a“first-come-first-served” basis. A system is needed whereby the marketvalues of these priority rights, which can be ranked according to thedistance from some desired attraction or attractions, can be fullyrealized.

Another characteristic which determines the value of some priorityrights is the time of entry into some venue. The established methods forselling these priority rights are not capable of garnering the fullmarket value of the rights. For example, theme parks, such asDisneyland™ and Busch Gardens™ , sell tickets at an inflexible price fora day's admission to the park. However, the actual time of admission tothe park on any particular day is generally determined by how early thepatron is willing to arrive at the park to stand in line. An earliertime of admission is desired by many patrons because the most popularattractions at theme parks often fill up quickly and maintain long linesfor the entire day. The desirability of early admission is evidenced bythe current practice of some theme parks, such as Walt Disney World™ inOrlando, Fla., which allow customers who stay at resorts affiliated withthe theme park to enter the park earlier than customers who do not.However, this practice consists of allowing all patrons of theaffiliated resort to enter the park at a set time, such as one hourprior to the admittance of the general public. This practice does notmaximize the profit that may be obtained by the selling of these rights.Some of those customers who stay at the affiliated resorts may bewilling to pay more to enter the park before other affiliated resortpatrons. Further, this system does not account for the profit that couldbe gained by allowing members of the general public to purchase theright to enter the park at a time prior to other members of the generalpublic. The relative value of these rights can be easily ranked, withearlier times of admittance having higher market values.

Another priority right with a market value dependent upon location, butfor which pre-ranking of the relative market values may not gamer thetrue market value of the rights, is the right to sit at a particulartable in a restaurant. A patron is likely to pay more to obtain a tablecloser to a window, for example, and is likely to pay less for a tableclose to the kitchen. However, individual patrons may prefer one windowview to another or may desire to sit at a table in a corner for moreprivacy. Therefore, a complete, objective ranking of such rights to sitat a particular table may not be entirely accurate. There is a need fora system which would enable the seller of these rights to obtain theirfull market value.

As discussed above, the right to begin a round of golf at a particulartime is a priority right for which the relative market values of relatedrights are difficult to determine prior to the sale of the rights. Thetee time itself is the pertinent characteristic that determines therelative values of the rights to begin rounds of golf throughout aparticular day. However, it is unclear prior to the sale of the rightswhich times are most desired by individuals wishing to play golf thatday. The established method for determining tee times at a golf courseis to set an inflexible price for playing a certain number of holes andthen offering tee times on a “first come first served” basis. At premiergolf courses, the system may be slightly different, requiring consumersto stay at a particular resort or be a member of an association in orderto purchase a round of golf. However, even within these premier systems,the tee times are generally offered on a “first-come-first-serve-d”basis. These systems fail to garner the most profit for the golf courseowners because individuals who attempt to reserve tee times after allthe times have been reserved may be willing to pay more than the ownerhas currently received for a particular time. Also, some individuals mayprefer to tee off at certain times of the day and, therefore, would bewilling to pay more for the right to tee off at those times. Forexample, a golfer may wish to be the first person to tee off on aparticular day, or a golfer may wish to tee off later in the afternoonto avoid the heat of the day and to view the sunset on the golf course.Therefore, the current system for selling golf tee times is sub-optimalbecause it does not account for individuals who would pay more to playat a particular time or for individuals who attempt to make reservationsafter all tee times have been reserved.

Another priority right with a relative value dependent upon individualconsumer preference and, therefore, difficult to rank prior to a sale isthe right to sit in a particular seat to view a movie in a theater. Whenviewing a movie, many individuals prefer to sit in the exact middle ofthe theater. However, others, such as those with small children, maywish to sit on an aisle, and others may prefer seats in the back of thetheater. Therefore, the market value of the right to sit in a particularseat is not determined by some easy calculation, such as the distancefrom the center of the screen, but is dependent upon each potentialmovie-goer's personal preferences. The current system of selling ticketsto the movie and then allowing admission on a “first-come-first-served”basis does not garner the full market value of the right to view themovie in a particular seat. Therefore, a system is needed whereby thefull market value of the right to sit in a particular seat to see aparticular movie at a particular time can be recognized by the theaterowner.

Some priority rights are unique in that it may be relatively easy in onesituation to determine the relative market value of related rights priorto their sale while in another situation it is very difficult. Oneexample of such a priority right is the right to view an art exhibit.For highly anticipated art exhibits, many individuals would be willingto pay a premium for the right to be one of the first to view theexhibit. Therefore, the true market value of the right to enter the artexhibit is not being achieved by the current system of either issuingselect invitations to a premiere night or simply allowing admission toticket holders on a “first-come-first-served” basis. In this situation,the priority rights could easily be pre-ranked with the earliest time ofadmittance being the most valuable. Thus, a system is needed whereby theexhibit organizer may realize the full market value of the right to viewsuch an exhibit.

However, on any day after the opening day of an art exhibit, therelative values of different times of admittance may vary more widelydue to the schedules of potential viewers. For example, one individualmay be willing to view the exhibit late in the afternoon because workprecludes any other time of attendance. Therefore, to that individual,the right to view the exhibit in the late afternoon is more valuablethan the right to view it in the morning. The current system of sellingtickets for an art exhibit does not account for this variance in marketvalue due to individual viewers' preferences. Therefore, there is a needfor a system that does yield the full market value of the rights sold.

Priority Right Auctioning System Options

In selling priority rights where the relative market values of thepriority rights can be easily pre-ranked, there also exists a need for asystem that can allow the purchaser to override the pre-ranking todenote the purchaser's own personal preference. For example, althoughseats in the front row at a concert are widely regarded as the bestseats and would be pre-ranked as the seats with the highest relativemarket value, an individual may wish to sit on the side of the stage tobe near a particular member of the performing group. If that individualwas willing to pay handsomely for the right to sit in a seat on theside, but not one in front of the stage, then the full market value ofthe right to sit in a seat on the side of the stage would only becaptured by a system which allowed the individual to denote his ownranking of desired seats. Also, a bidder may be willing to pay a premiumfor the right to sit in the first few rows but not for the right to sitin all the seats in a section specified by the seller of the rights.Therefore, a system is needed whereby a bidder may personally designateone or more priority rights and then offer to pay up to a certain amountfor those rights.

Additionally, when purchasing priority rights consumers often wish todesignate alternative bids. For example, an individual who wished topurchase the right to sit in a seat at an event may only be interestedin sitting in the first few rows if it would cost below a particularprice. If that person's bid was unsuccessful for that section ofpriority rights, however, he may be willing to sit in one of a group ofseats in another location for some lesser amount of money. The currentmethod of selling priority rights does not accommodate this desire bythe consuming public to designate individually-tailored alternativepriority right bids. Therefore, there is a need for a system thatsatisfies this desire.

Shortcomings of Current Auctioning Systems

Logistically, auctioning of priority rights has not always been feasibledue to the large quantity of unique rights and even larger quantity ofbuyers wishing to purchase them. A few auction systems have beendeveloped that operate using the Internet as the communications mode.These systems have been used to auction items such as computerequipment, artwork, and special items for charity. However, thesesystems are not suitable for use in connection with a real-time massauction of priority rights. With the currently operating systems,generally the items being sold are of a small quantity or individuallyunique. In most of the currently operating systems, the items for saleare individually listed and individually bid upon using e-mail over aperiod of days or weeks. While, the currently operating systems areuseful for such limited purposes, they have several shortcomings.

One such shortcoming arises from the use of e-mail to place bids and toupdate participants of their bid status. While in theory e-mail isinstantaneous, there are occasional routing delays of which the senderis often not immediately aware. In an auction of a slow, deliberatenature such as those presently operating, this is not a great concern.However, in a fast pace auction with numerous participants some bidscould be lost as delayed e-mail, unbeknownst to the participant.

An additional problem with the e-mail approach is that time may elapsebefore the bid information is read and applied. Therefore, theparticipant may not get instantaneous feedback on other bids which maybe taking place simultaneously. The participant often must wait for someperiod of time to learn if the bid is successful. If the participant hasa strategy for bidding on a very desirable item, the participant mustreturn to the auction numerous times to follow its progression.

Most currently operating systems provide some general bid status data,usually a minimal amount of information such as “current” high bid. This“current” high bid is updated by periodically reviewing the bidsreceived, and entering the highest bid to date. Therefore, these“current” bids are not current up to the second. Moreover, if there aremany of a particular item, such as event tickets or golf tee timeshaving a continuum of values, participants need to know considerablymore than the high bid information in order to make an informed biddingdecision.

Currently operating systems do not provide bid status informationupdates independent of solicitation of the information fromparticipants. Once the Internet auction site is accessed, theinformation conveyed may become outdated as it is being viewed. Againthis would be quite unfavorable for fast-paced auctions. Therefore, evenwith auction sites which were actually being updated real-time, aparticipant would need to continually re-access the site in order tokeep information truly updated.

One Internet auction system, “onsale” at http://www.onsale.com/ attemptsto overcome the e-mail auction problems by automatically updating itsInternet site. However, like the other Internet auction sites, “onsale”conducts relatively slow, deliberate sales, and still relies on e-mailto transmit some of the bid information. In addition, although the“onsale” auction site is automatically updated, it does notautomatically present this information to participants. As explainedabove, participants need to continually re-access the site in order tokeep information truly updated.

U.S. Pat. No. 4,689,928 details an auction system for used cars that iscapable of interactive, essentially real-time auctioning. Instead ofbeing Internet based, this used car auctioning system is constructedwith a 4-level hierarchy of computers networked to a plurality of autodealers terminals. At each level, the bids received by the computer areprocessed and only select bids are transmitted to the next level. Thebids are raised in increments of 3000 yen and the participants may bidvia a single signal indicating a “yes” in response to the bid beingraised. This system is based on the traditional auction format, and isused to sell one item or lot at a time. When a car has been auctioned, adisc is loaded by each dealer into his terminal which shows thephotograph of the next car to be auctioned. Bidding is limited to apredetermined group of auto dealers. Because the structure of thissystem is hierarchical, i.e. not on the Internet, it is not practicalfor use in wide-spread auctions available to consumers. Because of themethodical nature of this system, selling a progression of single itemswith incremented bids, it is geared for low volume sales of items withrelatively high values.

Recently tickets have been made available for purchase on the Internet,for example at http://www.ticketmaster.com and http://www.tickets.com.However, at these Internet sites, sales are of the traditional pre-setpricing, “first-come-first-served” format. Some Internet sites do offertickets in an auction format, but only a few tickets to select eventssold by individuals who have purchased the tickets and are attempting toresell them. Examples of such sites are http://www.ebay.com,http://auctions.yahoo.com, http://www.allsoldout.com, andhttp://www.busyrhino.com.

Considering the selling of a large number of priority rights, there areunique circumstances which present challenges not manifested in sellingother types of rights. Since the values of priority rights vary widelydepending upon the difference in a pertinent characteristic, it is notpractical to mass the priority rights into simple generic blocks to beauctioned. Nor is it practical to list and auction each priority rightindividually, since this could present auction participants with aprohibitively large number of individual auctions, and no practical wayto obtain contiguous priority rights. In other words, if a bidder wishedto purchase the right to sit in four adjacent seats at a show or movie,and the right to sit in each seat was sold in a separate auction, itwould be virtually impossible for the bidder to monitor everycombination of four adjacent seats and make appropriate bids.Accordingly, there exists a need for a system which can, within asingle, clear format, auction a large number of rights with a continuumof values, each at its market price. Furthermore, this system needs toapply logic in sorting bids based not only on price, but on clusteringrequirements to ensure that within a multiple priority right bid, thepriority rights are contiguous. This would require a databaseconfiguration unlike that employed by the prior art.

Moreover, given the furious pace of sales for many premium priorityrights, there exists the unique and as yet, unmet challenge of providinginstant, automatic, comprehensive feedback for the status of arelatively complex arrangement of standing bids. Frequently the morepopular sporting and entertainment events sell all available tickets ina matter of a few minutes. The number of tickets to these events mayreach into the hundreds of thousands. A practicable auction of priorityrights for such an event would require a system uniquely designed toprocess this large volume while presenting an updated, clear andinformative view of the proceedings to all participants. It would belogical to presume that efficient conveyance of bid information for alarge, complex pattern of bids would require a graphical representationof the bid standings. Although some Internet auctions employ graphicalrepresentation of objects for sale, none employ graphical representationof bid status.

Another need for on-line auction systems is a method of convincingbidders to place their bids early instead of waiting to bid at the lastminute before the auction closes. As mentioned previously, on-lineauctions are typically conducted over a set period of time. With thesesystems, bidders often wait until the last possible second beforeauction closing to place their bids in an attempt to block subsequentbidders from making higher bids. Such actions by bidders not only keepsthe price of the auctioned item undesirably low, but sometimes resultsin a large quantity of bids just before auction closing which theon-line system is not capable of handling. Thus, it would beadvantageous for an on-line auction system that provides incentives forbidders to place their bids early in the auction rather than waitinguntil the last minute.

In addition, ticket auction participants occasionally need to have twoor more mutually exclusive ticket purchase options available to them.Ticket purchase decisions are often made based on price and availabilityof seats having acceptable locations. Even the number of tickets aconsumer wishes to order may be dependent on price. For example, aconsumer may desire two front row tickets if they are within his budget,otherwise he desires four tickets in a different location within budget,otherwise he desires ten tickets anywhere available within budget. Butwith auctions of pre-ranked seats, some such information cannot be knownuntil the auction has ended, unless the auction close is phased-out fromthe best to the worst seats. There exists a need to make solutionsavailable in the form of mutually exclusive, prioritized bidssimultaneously entered by a consumer in a ticket auction.

In addition, not all ticket auction customers will agree with the exactseat pre-ranking assigned for an auction. For example, a race fan mayprefer seats behind his favorite driver's pit stop. An older fan at anarena concert may wish to be as close as possible without being on thefloor, where he assumes fans will stand during much of the show. Again,there exists a need for mutually exclusive, simultaneous prioritizedbidding in order to provide this flexibility to fans.

Another shortcoming of currently established methods for selling ticketsand other priority rights is their inability to reap for the priorityright seller the dramatic increases in market value of priority rightsimmediately prior to their usage. For example, in the days immediatelypreceding a popular concert or movie premiere, the market value oftickets to those events typically increase dramatically as publicityincreases and the public focuses on the event. However, because a largepercentage of the public must plan their schedules far in advance, it isnot feasible to only sell tickets to these events in the few days beforethe event occurs. Therefore, tickets are sold months in advance andpopular events sell out before the true market value of the rights toattend the event can be determined. A system is needed that permitsindividuals to reserve priority rights a sufficient amount of time inadvance but that also garners for the priority right seller the fullmarket value of those rights.

A potential negative effect of a system that places primary emphasisupon the maximum amount of money an individual is willing to pay for aparticular right is that less affluent members of the consuming publicwill be unable to procure desired priority rights. Under currentestablished methods for selling priority rights which offer rights on a“first-come-first-served” basis, individuals of limited means may stillpurchase rights if they are willing to stand in line for an extendedperiod of time. Also, a system that only seeks the highest profit marginin priority rights sales would not permit special treatment of certainbidders, such as alumni group members, company employees, or frequentpurchasers. Such special treatment may be important to the public imageof a priority right seller, and, thus, its long-term economic success.Therefore, there is a need for a priority right sales system that may bemodified to favor members of a selected group, such as those of limitedmeans or company employees.

Additionally, to achieve the full market value of a group of priorityrights, the administrator of a priority right sales system must beequipped with certain statistical information regarding the progress ofthe sale. Therefore, a system for selling priority rights should becapable of real-time statistical analysis to aid the systemadministrator in regulating the system to achieve optimal results.

In spite of their shortcomings, the above mentioned prior art systemsare useful for their respective intended purposes. However, given theirlimitations, and the above noted unique circumstances for mass priorityright sales, it is simply not practical or feasible to apply any of theprior art to the particular task of auctioning a large volume ofpriority rights.

SUMMARY

Accordingly, an object of the present invention is to provide a computercontrolled auctioning system, in which an large number of participantsmay have simultaneous access to bid on to the desired priority rights.The above stated needs as well as others are fulfilled by the presentinvention through a system constructed to sell a large number ofpriority rights in a very short time, each said priority right beingsold for a value set by existing market forces. The system providesparticipants with simple, yet informative graphical standing bidinformation on the entire stock of priority rights available, and allowsthem real-time bidding interaction. This system can achieve such saleseven for priority rights garnering extremely high public interest,without excluding any potential purchasers.

The present invention achieves said objectives by employing a computercontrolled priority right auctioning system which receives and evaluatesbid information records received from a plurality of remote terminals,said bid information records corresponding to bids for one or morepriority rights.

The automated priority right auctioning system is comprised of a memorystoring a plurality of previously accepted bid information records, saidrecords each including identification information, section information,quantity information, and bid price information. The automated priorityright auctioning system is further comprised of a central controllingcomputer operably connected to the memory and operable to receive amessage including a received bid information record from one of aplurality of remote terminals through a communication system, determinea lowest minimum acceptable bid value corresponding to the receivedsection information using the previously accepted bid informationrecords stored in the memory, and store the received bid informationrecord if a value represented by the received bid price informationexceeds the lowest minimum acceptable bid value.

The central controlling computer is further operable to, in a likemanner, receive, evaluate and store, if acceptable, subsequent bidsreceived and to stop receiving subsequent messages after a predeterminedtime period.

Within the automated priority right auctioning system, each previouslyaccepted bid information record includes rank information based on thesection information and the bid price information, and the centralcontrolling computer is further operable to assign a rank to eachreceived bid information record based on its section information, itsbid price information, and the previously accepted bid informationrecords.

After stopping receiving subsequent messages, the central controllingcomputer is further operable to associate one or more particularpriority rights with a previously accepted bid information record basedon the rank information and the section information of each of aplurality of previously accepted bid information records.

The automated priority right auctioning system further includes aprogrammed graphical representation method designed to efficientlyconvey to auction participants useful standing bid information across aspectrum of priority rights to be auctioned, allowing current priorityright bid prices to be quantified in an effective manner.

The system further includes programmed methods for ensuring contiguousgrouping of priority rights within each multiple priority right bid, andfor ensuring that the standing bid information is automatically updatedon a real-time basis and presented as such to all auction participants;said programmed method employing HTML programming features such as therecently available META refresh (a client pull type browser directive)or the multipart/mixed MIME format (a server push type browserdirective).

Participants may access this system from remote sites using terminals,such as personal computers, via telephone lines or other means ofcommunication. The status of bids and their corresponding priorityrights are conveyed on graphic displays which are updated on a real-timebasis for all participants to view. Participants may place bids of anyamount, subject to predetermined limits, and cancel, raise, or lowerbids at will. In addition, participants may view their personal bidstandings and the updated overall bid standings without having tocontinually re-access the auction site. Through the participants' remoteterminals, the personal bid requests are sent to the host computer whichimmediately processes, and sorts the bids according to section andprice. The central computer immediately updates and displays the new bidstanding order. When the auction is closed, the bids become fixed andthe physical transaction can occur.

The system further includes the ability for participants to limit theirbids to particular types of priority rights. Additionally, the systemwill allow participants to lock-in their priority rights before auctionclosing upon the payment of a premium. Also, the system provides forproxy bidding which allows participants to automatically increase bidamounts to match subsequent higher bids. The system further includes theability for participants to define their own personal bidding sectionsand to make alternative bids. Also, the system provides incentives forcompelling bidders to place bids well in advance of auction closing.

In addition, it would be advantageous for the system to further includethe ability for each participant to place two or more prioritizedsimultaneous but mutually exclusive bids in a single ticket auction.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an exemplary system built in accordancewith the present invention.

FIG. 2 is a flowchart illustrating an exemplary system built inaccordance with the present invention.

FIG. 3 is a flowchart illustrating an exemplary participant registrationprocedure used in a system built in accordance with the presentinvention.

FIG. 4 is a flowchart illustrating an exemplary auction procedure usedin a system built in accordance with the present invention.

FIG. 5 is an exemplary representation of the main auction databasestoring the order of bids received.

FIG. 6 is an exemplary representation of a referring database whichstores the available priority rights for sale.

FIG. 7 is an exemplary representation of a referring database whichstores the participants identity and personal and payment information.

FIG. 8 is an example of the statistical record of all bid eventsreceived, for use in marketing studies and customer service.

FIG. 9 is an example of the participant's terminal screen, as it mightappear before the beginning of an auction. The terminal displays agraphical representation of a venue of seats, the rights to which are tobe auctioned, and the preset minimum bid price of those rights.

FIG. 10 is an example of the participant's terminal screen, as it mightappear during an auction. The terminal displays a graphicalrepresentation of the rights to be auctioned, the present bid price ofthose rights, and the personal bid standing for this particularparticipant.

FIG. 11 is an example of the participant's terminal screen when thedesired section is chosen for bidding. The bid form is included on thisscreen.

FIG. 12 is a flowchart illustrating an exemplary algorithm used toensure contiguous priority rights within each bid in a system built inaccordance with the present invention.

FIG. 13 is a flowchart illustrating an exemplary algorithm used to matchthe number of available priority rights with the number of seatsrequested by winning bidders in a system built in accordance with thepresent invention.

FIG. 14 is an example of the participant's terminal screen requestingfurther information from the participant about participant preferences.

FIG. 15 is an example of the participant's terminal screen showing abidding activity meter during open bidding.

FIG. 16 is an example of the participant's terminal screen showing thebidding activity meter of FIG. 15 after bidding is closed.

FIG. 17 is an example of the participant's terminal screen, as it mightappear during an auction. The terminal displays a graphicalrepresentation of the rights to be auctioned and the present bid priceof those rights.

FIG. 18 is an example of the participant's terminal screen, as it mightappear during an auction; the terminal displays a graphicalrepresentation of the rights to be auctioned and the present bid priceof those rights.

FIG. 19 is a flowchart illustrating an exemplary algorithm within step50 of FIG. 4 for processing alternative priority right bids.

FIG. 20 is a flowchart illustrating an exemplary algorithm for sortingunranked priority rights.

FIG. 21 is an illustration of an auction for the right to begin a roundof golf at a particular time conducted using the automated priorityright auctioning system of the current invention and the algorithm ofFIG. 20.

FIG. 22 is a graph of the gross revenue of an automated priority rightauction versus the time over which the auction took place.

FIG. 23 is a graph of the gross revenue of an automated priority rightauction versus the time over which the auction took place denoting theduration and effect of various events on the gross revenue.

FIG. 24 is the graph of FIG. 22 and a graph displaying the change in therate of growth of the gross revenue of an automated priority rightauction per minute of the auction.

FIG. 25 is the graph of FIG. 22 and a graph of the number of priorityright lock-ins ordered and the amount of the priority right lock-inpremium versus the time over which the auction took place.

FIG. 26 is a graph of the average price per priority right in anautomated priority right auction versus the time over which the auctiontook place.

FIG. 27 is a computer display of two graphs and two frames displayingstatistics pertaining to an automated priority right auction of therights to sit in a particular seat at an event.

FIG. 28 is an example of the participant's terminal screen afterselection of a priority bidding option.

FIG. 29 is an example of the participant's terminal screen uponselecting a first priority location.

FIG. 30 is an example of the participant's terminal screen afterclick-and-drag adjustment of a first priority boundary area.

FIG. 31 is an example of the participant's terminal screen afterentering a first priority quantity and bid amount, and submitting afirst priority bid.

FIG. 32 is an example of the participant's terminal screen uponselecting a second priority location.

FIG. 33 is an example of the participant's terminal screen afterentering a second priority quantity and bid amount, and submitting asecond priority bid.

FIG. 34 is an example of the participant's terminal screen afterentering a third priority location, quantity and bid amount, andsubmitting a third priority bid.

DESCRIPTION

A computer controlled priority right auctioning system is now describedwith reference to FIGS. 1-34. Although many of the Figures anticipatethat the priority rights being auctioned are in the form of tickets forseats to a venue during a particular event, as described herein thepriority right auctioning system may be used to auction any of a numberof different types of priority rights, examples of which are providedabove in the Background. Therefore, references in the Description tocertain pieces of auction information, such as “groups” and “subgroups”or “sections” and “subsections”, may not apply to all priority rightauctions. In addition, the term “priority rights” is used throughout theDescription to represent all such priority rights which may be auctionedusing the system.

FIG. 1. shows a computer controlled ticket auctioning system 10 which isbuilt according to the present invention. As, shown, the computercontrolled ticket auctioning system 10 is comprised of a centralcomputer 12 such as an Internet server which sends and receivesinformation through a communication system 13 such as the publictelephone system, television cable system, or satellite communicationssystem to remote terminals 14.sub.1, 14.sub.2, 14.sub.3 . . . 14.sub.n,such as personal computers or other network accessing devices. In thisembodiment, Internet sites are constructed consisting of web pages ofgraphics and text stored as html files, which present the necessaryinformation pertaining to upcoming events and ticket sales. These sitesare stored in the memory of the central computer 12. The constructionand initiation of these sites is shown as step 22 and step 23 in FIG. 2,which is a flowchart illustrating the general operation of thisexemplary system.

Accordingly, consumers wishing to become participants (also referred toherein as “bidders”) in an upcoming auction may access the centralcomputer 12 of FIG. 1 through any remote terminal 14 ₁, 14 ₂, 14 ₃, . .. 14 _(n) to receive a wide variety of information about the auctions,the related events, venues, performers or teams, schedules, andmerchandise; and to pre-register for the auction and payment. Theregistration process is represented as step 24 in FIG. 2. Next, as FIG.2 illustrates, the auction operation 25 is executed; the transactions 26take place, and the system is ended 27. These steps are described inmore detail below.

Registration Procedure of Auctioning System

Referring again to FIG. 1, registration and bid information originatingin the remote terminals 14 ₁, 14 ₂, 14 ₃, . . . 14 _(n), is transferredvia the communication system 13 and received by the central computer 12.The central computer 12 processes said information and stores it indatabases: specifically, the participant database 15 for registrationsand the main auction database 16 for bids. The word database, as usedherein, and in the appended claims is intended to refer to a collectionof information organized in such a way that the central computer canquickly select and store desired pieces of data within the database. Theinformation in the database may be stored in any of several ways,including, but not limited to, magnetic storage, optical storage, or anyother form of storage known in the art. The central computer 12 alsoperforms sorting and indexing operations, described below, necessary tokeep the information in the databases current and correctly ordered. Thecentral computer 12 processes and controls the information flowingbetween the Internet sites and the databases with programming written inthe C++ programming language or any of the other computer programminglanguages known by one skilled in the art. Registration information maybe received and stored before and during operation of the auction. Theparticipant database, represented by FIG. 7 contains the name, address,and payment information for all participants, and is used as a referringdatabase to the main auction database, represented by FIG. 5, during theopen auction and for billing purposes when the auction is concluded.FIG. 5 and FIG. 7 are detailed below.

Referring again to FIG. 1, a master computer 11 is connected to thecentral computer 12 for purposes of setting up, initiating, monitoringand dismantling the auction, and its related sites or pages. Forexample, in preparation for an auction, numerous details specific tothat auction, such as minimum initial bids, event and sponsor names,dates and times, and arrangements are generated using the mastercomputer 11 and then transferred by disk or modem or other means to thecentral computer 12 when needed. The central computer 12 stores theseparameters for later application to the auction process. In particular,the central computer 12 stores in the ticket database 17 a unique recordfor each ticket available. The auction is then conducted by the centralcomputer 12, as described below. During the auction, the master computer11 can be used to monitor the auction progress, make any necessaryspontaneous changes to existing parameters, and to generally ensure thatthe auction is conducted with a minimum of problems. In practice, it maybe possible to combine the functions of the central computer 12 and themaster computer 11.

Step 24 in FIG. 2 is illustrated in detail by FIG. 3, an exemplaryparticipant registration flowchart. The potential registrant begins instep 28 by interfacing with one of the terminals, for example, terminal14.sub.1, of FIG. 1. When the rules and registration Internet site isaccessed at step 29 of FIG. 3, the registrant is encouraged to read theauction rules thoroughly, and agree to their terms. This site includes aregistration form which will contain that registrant's personalinformation including records for the fields illustrated in theparticipant database of FIG. 7, as well as a checkbox for agreement tothe terms of the auction rules, and a password, if desired, to protectaccess. The password may be chosen for use when accessing the auction,in lieu of re-entering the credit card number. This allows theparticipant to have an agent place bids, without disclosing the creditcard number.

The central computer 12 of FIG. 1 performs all remaining steps in thisregistration process depicted in FIG. 3. In step 30, of FIG. 3, theregistration information is received and in step 31, a determination ismade as to whether the information is satisfactorily complete. If not, amessage to that effect is sent in step 32 back to the registrant, andthe registration process is ended at step 39. If the registrationinformation is satisfactorily complete, then in step 33, the creditinformation is obtained through existing credit card systems forcomparison to the information given by the registrant. In step 34, saidcomparison is performed and if the credit information does not match orthe limit is exceeded, a message to that effect is sent in step 35 backto the registrant, and the registration process is ended at step 39. Ifin step 34 the card is determined to be valid and the limit not to beexceeded, then in step 36, an ‘authorization only’ hold is placed on theregistrant's credit card, for an amount specified by the participant.This limit, also stored in the participant database of FIG. 7, will bethat registrant/participant's maximum allowable bid during the upcomingopen auction. The authorization hold verifies and reserves the paymentmeans for the seller, while limiting unauthorized bids made by agents ofthe registrant/participant. Referring again to FIG. 3, in step 37, theregistrant is notified that the registration was accepted and then instep 38, the records are sent to the participant database before theregistration is ended in step 39.

At step 22 of FIG. 2 before the auction is opened, an Internet site isconstructed and initiated to provide viewing of graphical displays ofthe priority right and sale information to the participants. FIG. 9represents one such view, with initial minimum bids displayed in eachsection of a venue for an auction of rights to sit in particular seatsat an event (i.e., “tickets”). All potential participants may access andview this site before the auction is opened. When the auction is opened,the central computer 12 of FIG. 1 activates the site to becomeinteractive, so participants can use it to place bids on tickets. Thesite activation is represented as step 40 in FIG. 4 which is discussedbelow. When a participant places a bid, the information is received andthen processed by the central computer 12 of FIG. 1 according to theflowchart outlined in FIG. 4.

Auction Procedure of Auctioning System

FIG. 4 is a flowchart illustrating an exemplary auction procedure whichis step 25 in FIG. 2. The central computer 12 of FIG. 1 performs allsteps in this auction process depicted in FIG. 4. In addition, all bidinformation received by participants' remote terminals is generated bythe central computer 12 of FIG. 1 as web-pages constructed of htmlprogramming code. The auction procedure illustrated by the flowchart inFIG. 4 is useful in auctioning all priority rights with relative marketvalues that can be easily ranked prior to the start of the auction. Thisauction procedure is also capable of auctioning the rights to sit inparticular seats in a movie theater if each right is sold as the rightto enter the theater at a certain time and freely select from allavailable seats. Larger bids permit their bidders to enter the theaterat earlier times to select seats. Therefore, the entrance times into thetheater are easily ranked, with earlier times more valuable than latertimes. Other priority rights that may be auctioned using this procedureinclude the right to be in a particular location, e.g., a seat, during aconcert, a theatrical event, a sporting event, or any other liveentertainment event. The auction procedure of FIG. 4 is also, withslight modification, capable of auctioning rights with relative marketvalues that are largely dependent upon individual consumer preferenceand, therefore, cannot be easily ranked prior to the sale of the rights.These modifications are described in more detail below.

Referring again to FIG. 4, in step 41 a bid information record (bid) isreceived as a response to a web-page form: an html programming toolcommonly used to submit information from a personal computer to aserver. A bid information record includes received identificationinformation, received section information, received quantityinformation, and received bid price information. When a bid is received,as in step 41, then in step 42 a check is made to ensure participant'sregistration is on record. This is accomplished by conducting a query onthe participant database 15 of FIG. 1, detailed in FIG. 7, using thereceived bid identification information as the query criterion. If thequery finds the participant is not registered, a message to that effectis sent in step 43 back to the participant, and the bid is not recorded.

If the query finds the participant is registered, then in step 44 ofFIG. 4, a check is made to ensure the participant's bid exceeds thestanding minimum bid for the particular section requested. This isaccomplished by conducting a query on the main auction database 16 ofFIG. 1, detailed in FIG. 5, using the received section information andbid price information as the query criteria. If the query finds the bidprice too low, a message to that effect is sent in step 45 back to theparticipant, and the bid is not recorded. If the query finds the bidprice is not too low, then in step 46, a check is made to ensure theparticipant's bid is less than the established maximum; specifically,the amount of the ‘authorization only’ hold established in theparticipant registration and stored, for example, under the field name“SLIMIT” in the participant database of FIG. 7. Again, this isaccomplished by conducting a query on the participant database using thereceived bid price information as the query criterion. If this maximumis exceeded, a message to that effect is sent in step 47 of FIG. 4 backto the participant, and the bid is not recorded. Upon receipt of such amessage, the participant may choose to re-register in order to raise theset maximum. However, an agent of the participant would be unable to doso without the credit card information. Thus, protection is afforded byuse of the password established in the participant registration andstored, for example under the field name “SETPASS” shown in theparticipant database of FIG. 7.

Referring again to FIG. 4, if the comparison in step 46 is positive,then the bid is accepted and displayed as in step 48. In step 49, thebid information record is recorded to the main auction database of FIG.5 and indexed to the corresponding participant in the participantdatabase of FIG. 7. In step 50 of FIG. 4, again using the received bidprice information as the query criterion, the bid is then inserted atthe appropriate rank in the ticket database of FIG. 6, described below,and indexed to the corresponding bid record in the main auction databaseof FIG. 5, with lower standing bids being reordered to reflect the newstandings. At this step, the lowest bid(s) are removed from the order,(bumped), unless additional tickets are still available. Bumped bids arestored in a market research database, represented in FIG. 8, the formatof which is similar to that of the main auction database. An addedfunction of this database is to ensure that an accurate record of eachbid event can be identified for customer service purposes. Next,participants whose bids become too low are notified.

As shown in step 51 and step 52, if the standing bid price of apre-selected key ticket in the graphical representation has changed as aresult of the latest bid, this change is reflected immediately byautomatically updating the display of the current bid standings. Theseprices are displayed within the graphical view of the priority right andsale information, just as the initial minimum bids were displayed inFIG. 9. A representation of this real-time bid status view is shown inFIG. 10. This interactive view gives participants clear, usefulinformation sufficient to make bid decisions, regardless of the numberof tickets for sale or what ticket is desired. More precise informationis readily obtainable by simply clicking the mouse on the desiredsection of seats. This action summons the bid form along with a moreprecise bid status graphic such as shown in FIG. 11. The standing pricesrepresented on these interactive sites are obtained by the centralcomputer 12 of FIG. 1 from records stored in the ticket database 17 andinserted into the html file for display to participants. This task isstep 52 of FIG. 4 and is repeated each time a change has occurred in thestanding bid price of one of these key tickets. This determination isrepresented as step 51 of FIG. 4. These changes are automaticallypresented to the participants by means of META refresh, a client pulltype html programming feature which directs the browser to automaticallyrefresh the information every x seconds, where x is a variableprogrammed into the html file code. If no key ticket prices havechanged, no further action is taken until the next bid is received orthe auction is ended.

FIG. 17 and FIG. 18 illustrate two alternative methods for displayingthe current bid values for the available tickets in an auction for theright to sit in a particular seat at an event. Referring to FIG. 17, theauction participant may scroll through a list 350 of available ticketsand their current standing bid values. As the participant highlights aparticular seat, a red star 352 appears on the graphical representationof all available seats 354 to display the highlighted seat's location.In FIG. 18, the auction participant may also scroll through a list 400of available seats and their current standing bid values. In thegraphical representation of all available seats 402 in FIG. 18, though,all the available seats are visible at all times. As the auctionparticipant highlights a particular seat in the list 400, the same seatis highlighted in the graphical representation 402.

Referring again to FIG. 4, in step 53 the auction may be ended inresponse to a signal which may be sent from the master computer 11 ofFIG. 1 or from an internal timer or some other predetermined means. Instep 54, of FIG. 4, finalizing the ticket assignments involvesapplication of an algorithm designed to ensure that seats within a bidare contiguous. Prior to the start of the auction, the seats may beorganized into specific sections and subsections, or groups andsubgroups, of rights. For example, if the rights to be sold are therights to sit in particular seats at an event, those rights may begrouped by section number and then divided into subsections by rownumber. Alternatively, during the pendency of the auction, each biddermay define seat sections or subsections. FIG. 12 is an example of analgorithm that ensures contiguous seats within a bid. For each section,or group, of seats in the auction this algorithm is executed, startingwith the highest bid, obtained in step 121, and working back. If the bidpresently under evaluation is the last in its section, then a differentalgorithm is used. This determination and action is step 122 and step123. If the bid presently under evaluation is not the last in itssection, then in step 124, it is determined if the number of ticketsrequired by the bid is more than the number available in its subsection,or subgroup. If so, it is impossible for all the seats to be contiguous,and the process begins for the next bid, in step 128. If not, in step125 the next decision is to see if there are any breaks in the seatsgrouping. If not, the process begins again for the next bid, in step128. If so, the group of seats is moved to the next subsection back,step 126, and the resulting seat vacancies are filled by moving the nextlower bid(s) forward, step 127. In unusual circumstances, this couldresult in the moved group spanning two subsections again. In thisexemplary algorithm, the group will not be moved again, it will remainsplit. When the last active bid is processed, the last-priority-rightalgorithm shown in FIG. 13 is applied. If the number of tickets in thebid is greater than the number of seats remaining in the section, step131, then in step 132 the bidder is notified of the cut-off and asked itthe reduced number of tickets will suffice. In step 133 and step 134 ifthe reply is negative or if there is no reply within 2 minutes, the bidis removed. If there is a positive reply, the number of tickets isreduced to the available amount, and the algorithm is ended.

Referring again to FIG. 2, step 26, upon auction closing, successfulbidders are immediately notified at their terminals and payment isconfirmed. The credit cards are debited for the appropriate amounts, andthe excess amount from the ‘authorization only’ hold is released. Proofof the bidder's ownership of the ticket is then delivered by any of anumber of conventional means.

FIG. 5 a and FIG. 5 b represent the main auction database which storesand ranks all active bid records and pairs the associated participantsand priority rights accordingly, by referencing the two referringdatabases. FIG. 5 a is the design view of this database, defining thefields and their parameters, while FIG. 5 b is the table view showingsample bid records for the first bids in a hypothetical auction. FIG. 6depicts the ticket database, which is the other referring database. Inauctions for easily ranked tickets, the ticket database of FIG. 6contains a record of each ticket in the auction arranged in order ofpreference as predetermined by the promoter or ticket seller. Inauctions for tickets with relative market values that are not easy torank, the ticket database of FIG. 6 contains a record of each priorityin the auction arranged in an order enabling efficient indexing of theticket records to the bid records in the main auction database.

The databases shown in FIG. 5, FIG. 6 and FIG. 7 contain records for ahypothetical auction that is greatly simplified for illustrationpurposes. This hypothetical event venue contains only 12 availabletickets, each defined by a record in the ticket database (FIG. 6 b). Asshown, minimum bids had been pre-set at $15 and the highest bid receivedwas bid #1 of $30, with a quantity of 2 tickets. The first field in theticket database, “RIGHTID” contains the unique ticket identificationnumber which is indexed to the main auction database (FIG. 5 b) by thefields “FRIGHTID” (first ticket identification number) and “LRIGHTID”(last ticket identification number). The last field is “BIDDERID”, inwhich are stored indices referencing records in the participantdatabase. As shown in FIG. 5 b, the lowest bid was #3, requesting 2tickets at $15. However, only one seat was reserved, since only one wasavailable at that bid level. As detailed in FIG. 13 above, when theauction is ended, if one ticket is not satisfactory, this participantwill be given the opportunity to cancel the bid.

FIG. 10 is a sample participant interface to the auction system duringthe open auction, represented here as a web page with graphical links toforms for placing bids on tickets to sit in particular seats for anevent. As exemplified here, the participant wishing to bid, simply usesa mouse to click on the desired ticket section, calling up a bid formand a more precise view of standing bids to use as a guideline. FIG. 11shows this more precise view for a participant who clicked on section C.The form on the right confirms this selection and prompts theparticipant for the specific bid information; while the diagram on theleft shows that if, for instance, the bid placed is $73, then thetickets will be in the middle of section C, unless future (higher) bidspush it back. Likewise, in practice it is possible, albeit tedious, todisplay bid prices in every subsection or even for every seat.

Accordingly, a ticket seller could promote numerous ticket salessimultaneously at one network site, with the added step for theregistrant/participant of choosing the desired sale from thosepresented.

In one embodiment, a template may be loaded into participants' terminalsprior to their accessing the auction site, said template providing textor graphic information that does not change during an auction or betweenauctions, such as background art, forms or instructions. Said templatemay be downloaded from the Internet, or installed from a disc or by someother means. Use of a template allows the bid status updates to be madewith transmission of only the numerical data, which in combination withthe template, presents the comprehensive auction status update toparticipants. In another embodiment, the bid status changes areautomatically presented to the participants by means of themultipart/mixed MIME format, a recently available server-push typeprogramming feature which takes advantage of a connection that is heldopen over multiple responses, allowing the server to send more data atwill. This method can be more efficient, since new HTTP connections donot have to be reopened.

Participant Preference Options of Auctioning System

Various other alternative embodiments of the invention are alsopossible. For example, as shown in FIG. 14, after a participant places abid, he or she is presented with participant preference options on aparticipant preference screen 200, which is a terminal screen that asksthe participant a number of questions concerning the participant's bid.Under a priority right options block 202 on the participant preferencescreen 200, the participant is given the participant preference optionof canceling the bid or moving back to another section if theparticipant is unable to secure a bid in the desired section. The systemwill generally default for the participant to be moved back a sectionunless the participant changes this option to cancel the bid in theevent of a bump. Thus, if a participant has bid on tickets in Section B,but that bid is bumped, the participant will automatically be moved backto Section C upon being bumped from Section B, unless the participantinstructs the system to completely cancel the bid in the event the bidis bumped.

Another participant preference option presented to the bidder under theticket options block 202 is the option for a premium subsection ticket,such as the right to sit in a front row seat at an event. Certainbidders may be exclusively interested in a premium subsection ticket.Under this option, the participant may instruct the system to cancel thebid if the bid is bumped from the premium subsection. Thus, if aparticipant makes a bid and specifies that he must be in the premiumsubsection, the system will cancel the bid if the bid is bumped from thepremium subsection. Alternatively, the participant may state that hesimply prefers the premium subsection, but will take other tickets.Thus, under this option, the system will leave the participant with apremium subsection ticket so long as his bid is consistent with theother premium subsection bids. If the participant is bumped from thepremium subsection, the participant's bid will not be canceled, but hewill simply be moved back. This will generally be the system default.Finally, the participant may state that he absolutely does not want apremium subsection ticket, and he should be moved back if his bid landshim in the premium subsection. Thus, under this option, the system willplace the participant in another subsection even if his bid qualifieshim for the premium subsection.

Another example of a premium subsection ticket is the right to sit in anaisle seat at an event. The ticket options block 202 would allow theparticipant to specify aisle seat preference as a participant preferenceoption. The system may present the participant with a number of choicesconcerning the aisle, including the following options: (i) must have anaisle seat and will move back to get on the aisle, (ii) will not acceptan aisle seat, (iii) prefer the aisle, but will accept other seats, (iv)do not prefer the aisle, and (v) don't care. The “don't care” option isgenerally the system default. Based upon the participant's input, thesystem will attempt to place the participant in the desired locationeither on an aisle or away from an aisle.

A number of other participant preference options other than thosedescribed above may also be specified in the ticket options block 202.For example, if the priority right is the right to sit in a particularseat at an event, the system may give participants options for beingplaced near concession stands, restrooms, exits, or the rear of asection. Other preference options are also possible and may be easilyincorporated by those of ordinary skill in the art.

The participant's preference screen 200 also includes an option 204 thatallows the system to receive lock-in ticket information. This option 204allows the participant to secure a ticket, upon payment of a premium,regardless of any subsequent bids for the ticket during the auction.This premium may be expressed in any number of ways such as a flatdollar amount (e.g., $25) or a percent of the bid value (e.g., 50%). Thepremium is expressed on the preferences screen 200 by lock-in premiumline 208. Thus, if the participant makes a bid of $80 per ticket forfive seats, and this bid currently places the bidder in a particularsubsection of seats, the participant may lock-in these five tickets uponpayment of the premium. If the premium is 50% of the bid value, theparticipant would be required to pay $120 per ticket, or $600 totaldollars to secure these five seats until the close of the auction. Ifthe participant does choose to lock-in his bid by paying the premium,the participant will retain all five tickets throughout the auction evenif a subsequent bidder offers $120 or more for the same tickets.

The participant's preference screen 200 may also include an option thatallows the system to receive proxy bid information. The proxy bidoptions are shown under proxy block 206. According to the proxy bidoptions, the participant may enter a maximum proxy bid amount inaddition to the current bid amount. The maximum proxy bid amount is theamount that the bidder authorizes the system to bid in his absence inorder to keep the bidder in the preferred seat or location. Under thisblock 206, the bidder has the following three options: (i) keep thebidder in the bidding for the same tickets for up to the maximum bidamount, (ii) keep the bidder in the same section of seats for up to themaximum bid amount, and (iii) keep the bidder in the bidding for anyticket in the auction for up to the maximum bid amount. Thus, if theparticipant bids $80 for a ticket in a certain section, but authorizesproxy bidding up to $130, the participant may leave the auction, knowingthat proxy bids will be made for him up to $130 should a subsequent bidexceed his bid. If the participant chooses the option to stay in thebidding for the same ticket for up to the maximum bid, the system willkeep the participant in the bidding for that ticket until subsequentbids for that ticket are received exceeding $130. At that time, theparticipant's bid will be bumped. If the participant chooses the optionto stay in bidding for the same section of seats for up to the maximumbid, the participant will be bumped to the rear of the section assubsequent bids are received for greater than $80. Once bids for therear of the section reach $80, the participant's bid will automaticallyincrease to keep him in the section up to a value of $130. Once all bidsin the section exceed $130, the participant's bid will be bumped.Finally, if the bidder chooses to simply stay in the overall bidding forup to $130, the participant's $80 bid will be continually bumped to lesspreferential tickets, as bid values exceed $80. Once the leastpreferential ticket reaches $80, the participant's bid willautomatically increase to keep him in the bidding for up to a bid of$130. If bids for the least preferential ticket exceed $120, theparticipant will be completely removed from the bidding.

The participant's preference screen 200 may also include an option thatallows the auction participant to individually designate those seatsupon which the participant wishes to bid. Instead of selecting to bidwithin the sections or subsections defined by the auction organizer,each participant may define his own personal bidding section. Oneembodiment of this invention is to allow the auction participant todefine the bounds of his personal bidding section by using a mouse to“click and drag” a cursor over a portion of the graphical representationof the available seats. Another embodiment involves permitting theauction participant to define his personal bidding section by enteringthe first and last seat identification numbers in the desired personalbidding section.

The participant's preference screen 200 may also include an option thatallows the auction participant to place alternative bids. For example,in an auction for the right to sit in a particular seat at an event, anauction participant could designate that she wished to stay in thebidding for the right to sit in a seat in Section A for up to $50, butif that bid was bumped then she wished to stay in the bidding for theright to sit in a seat in Section D for up to $25.

This option to place alternative bids may be used with the seat sectionsdesignated by the auction organizer, as in the previous example, or withthe participant's personal bidding sections. Therefore, the auctionparticipant could designate that she wished to stay in the bidding for aright in her first personal bidding section for up to $45, and if thatbid was bumped then she wished to stay in the bidding for a right withinher second personal bidding section for up to $25. Additionally, morethan two alternative bids may be placed.

FIG. 19 is a flowchart of an exemplary algorithm that permits thetickets auction system to properly process alternative bids. Thisalgorithm is step 50 of FIG. 4. In processing this algorithm, theautomated ticket auction system processes each alternative bid as aseparate bid. For example, if an individual designated a bid of $50 forrights within a first section, a first alternative bid of $30 for rightswithin a second section, and a second alternative bid of $20 within athird section, the system would record all three bids. However, thesystem would only activate the $30 bid after the $50 bid was bumped andwould then activate the $20 bid only after the $30 bid was bumped.

Referring to FIG. 19, in step 400, all tickets bids are sorted. As aresult of this process, some bids may be bumped. In step 402, thecentral computer 12 determines whether any bids have been bumped. If nobumped bids exist, the control is passed, in step 404, to step 51 ofFIG. 4. If a bid has been bumped, in step 406 the central computer 12determines whether the bumped bid is part of a series of alternativebids. If not, in step 408 it is determined whether any other bids werebumped by the sorting undertaken in step 400. If other bids were bumped,control is passed back to step 406. If no additional bids were bumped,the central computer 12 proceeds to step 404. Referring again to step406, if the bumped bid is part of a series of alternative bids, thecentral computer 12 then determines, in step 410, whether the bumped bidwas the last alternative bid in the series. If the bumped bid was thelast alternative bid in the series, the central computer 12 proceeds tostep 408. If not, the central computer 12 activates, in step 412, thenext alternative bid in the bumped bid's series.

Then, in step 414 the central computer 12 determines whether theactivated bid exceeds the standing minimum acceptable bid for thetickets identified in the activated bid. This is accomplished byconducting a query on the main auction database 16 of FIG. 1, detailedin FIG. 5, using the received section information and bid priceinformation as the query criteria. If the query finds the bid price toolow, a message to that effect is sent in step 416 back to theparticipant, and the bid is not recorded. If the query finds the bidprice is not too low, then in step 418, a check is made to ensure theparticipant's bid is less than the established maximum; specifically,the amount of the ‘authorization only’ hold established in theparticipant registration and stored, for example, under the field name“SLIMIT” in the participant database of FIG. 7. Again, this isaccomplished by conducting a query on the participant database using thereceived bid price information as the query criterion. If this maximumis exceeded, a message to that effect is sent in step 420 of FIG. 19back to the participant, and the bid is not recorded. Upon receipt ofsuch a message, the participant may choose to re-register in order toraise the set maximum. However, an agent of the participant would beunable to do so without the credit card information. Thus, protection isafforded by use of the password established in the participantregistration and stored, for example under the field name “SETPASS”shown in the participant database of FIG. 7.

Referring again to FIG. 19, if the comparison in step 418 is positive,then the bid is accepted and displayed as in step 422. In step 424, thebid information record is recorded to the main auction database of FIG.5 and indexed to the corresponding participant in the participantdatabase of FIG. 7. In step 426, the central computer 12 determineswhether any additional bids were bumped by the sorting of step 420. Ifso, the central computer 12 returns to step 406 so that all bids bumpedby the sorting of step 420 can be examined for related alternative bidsbefore all of the bids are re-sorted. If the comparison in step 426 isnegative, the central computer 12 returns to step 420 to re-sort all ofthe ticket bids with the inclusion of the newly accepted bid. Thisalgorithm is only one of various available means to enable the properprocessing of alternative bids by the ticket auctioning system of thisinvention.

Alternative Embodiments of Auctioning System

In another alternative embodiment of the invention, a bidding activitymeter 302 is used as shown in FIG. 15. The bidding activity meter showsa graphical representation of the rate of bidding on tickets (e.g., bidsper hour or total bid revenue increase per minute). The meter shows anumber of different bidding rates from left to right across the meter. Abar extends from the left side of the meter toward the right side of themeter to represent the current bidding rate. In this manner theparticipant can see the current rate of bids placed for tickets. Thebidding activity meter allows the system to have an adjustable biddingwindow based upon bidding activity. The adjustable bidding window may bedefined as an adjustable period of time that may be immediatelyterminated upon the bidding rate reaching a predefined low threshold.For example, the system may set up an auction for tickets starting at 10a.m. on a particular day. The auction may be set up to accept bids forat least five hours, until 3 p.m., but for no more than fourteen hours,until 12 p.m. Bidding will remain open after 3 p.m., so long as thebidding continues above the predetermined threshold (e.g., 1000 bids perhour). However, if the bidding drops below that threshold, the auctionwill be closed immediately. Thus, the auction will definitely acceptbids from 10 a.m. until 3 p.m. If the total bidding from 3 p.m. to 4p.m. exceeds the threshold rate, the bidding will remain open. However,if at any time before 12 p.m., the bidding rate drops below thethreshold, the bidding will immediately cease. Thus, if the threshold is1000 bids per hour and the total bidding during the hours of 9 p.m. and10 p.m. drops to 900 bids, the auction will close, and no further bidswill be taken.

Because the auction may be conducted over an adjustable time periodusing the bidding activity meter, the bidding activity meter encouragesbidders to place their bids early and not wait until the very lastminute before auction closing to place their bids. When a large numberof bidders wait to bid at the very last minute before auction closing,the system may be unable to handle the large number of bids and allbidders may not be allowed to place their bids. If all bids are notplaced, the market price per ticket is not realized. However, thebidding activity meter prevents this problem by encouraging bidders toplace their bids early. With the bidding activity meter 302, bidderswill monitor the bidding activity meter and place their bids immediatelywhen they realize that bidding is reaching the low threshold level.Because bidders will likely have a continuum of differentinterpretations as to when the bidding activity meter is reaching thelow threshold level, bids will be more evenly distributed over time andthe intensity of the final bidding will be decreased.

In a further embodiment of the invention, bidding may be split into afirst session and a second session. In this first session, bids aretaken to determine which bidders will receive the tickets. In thissession, a market price is determined for the least preferential ticketin the auction. Alternatively, bidders may bid on the least preferentialticket in each section. Bidders making bids in excess of the marketprice are guaranteed a ticket and allowed to bid in the second session.In the second session of bidding, bidders place bids on particulartickets in the auction. The most preferential tickets in the auction areawarded to the highest bidders, consistent with the method of conductingan auction described herein. The bid activity meter 302 may be used inboth the first and second session of bidding to define the time limitsthat bidders have to place bids during the first or second sessions.

In yet another embodiment of the invention, priority bidding may beoffered. In the ticket auction context, priority bidding allows the bidparticipant to place a prioritized bid that acts as a packet of bids andincludes a first bid as well as at least one back up bid in the eventthat the first bid or other higher priority bid in the prioritized bidis rejected during the auction. By way of example, FIG. 28 shows theparticipant's terminal screen 400 after selection of the prioritybidding option. The participant first selects and clicks a location onthe venue map, which generates a colored area defining the areaboundaries of this first priority bid. FIG. 29 shows the participantterminal screen 402 at this point. The first priority bid area may thenbe adjusted by the participant by clicking and dragging the boundaries,as shown in FIG. 30, terminal screen 404. In this example, theparticipant's first priority bid is for tickets to seats near the stagein the first section, but does not include tickets on the right side ortoward the rear of the front section. Next, the participant enters thedesired number of seats and bid amount he wishes to place, and submitsthe bid.

After submission of the first priority bit, a terminal screen such asscreen 406 in FIG. 31 is shown that allows the participant to enter asecond priority bid. As shown in FIG. 31, the participant is prompted toenter a second priority bid location, number of seats desired and bidamount, and is allowed to adjust the second bid location area accordingto his or her wishes. FIG. 32 shows the participant terminal screen 408after the participant has entered the second priority bid location, buthas yet to enter the information about the number of desired seats andthe bid amount. FIG. 33 shows the participant terminal screen 408 afterthe participant has entered quantity and bid amount information andsubmitted the second priority bid.

After submission of the second priority bid, the participant may chooseto enter a third priority bid or any number of priority bids. Enteringthird or additional priority bids is performed in generally the samemanner as described above for the first and second priority bids. Rightclicking with the mouse selects an entire section for the area of a bid,as shown in FIG. 34 with participant terminal screen 410.

When the first priority bid of a prioritized bid has been entered by thebid participant, it becomes active immediately, and is either acceptedor rejected by the system. When the lower priority bids are entered,they remain inactive unless other bidders bump the first priority bidout such that the bid is no longer acceptable within its defined area.If the first priority bid is bumped or otherwise rejected during theauction, the second priority bid is then activated. If the secondpriority bid is bumped, the third is activated and so on. If allpriority bids are bumped, the participant must raise one or more bids orenter a new bid in order to purchase tickets.

As mentioned above, the auction procedure illustrated by the flowchartin FIG. 4 may be modified to permit auctioning of priority rights withrelative market values that are difficult to rank prior to their sale.In the auction of a group of such priority rights, two consecutivepriority rights may have widely different market values due toindividual consumer preference. For example, the value of the right tobegin a round of golf at 9:00 a.m. may be significantly greater than thevalue of the right to begin a round of golf at 9:15 a.m. if anindividual consumer's schedule dictates that he must begin at 9:00 a.m.Therefore, instead of classifying such priority rights into sections andsubsections and determining the amount of an acceptable minimum bid byviewing the lowest bid in a particular section, the minimum acceptablebid for each priority right must be evaluated individually as a bid isplaced upon the priority right. The auction procedure illustrated by theflowchart in FIG. 4 will satisfy this requirement if each priority rightis treated as its own section in the bidding process and somemodification is made to the central computer's sorting algorithm.

In an auction for priority rights that are not easily pre-ranked, thesorting algorithm of step 50 in FIG. 4 and step 400 of FIG. 19 isslightly modified. One exemplary algorithm that illustrates thismodification is shown in FIG. 20. In step 428, the central computer 12performs a search over the entire spectrum of received priority rightbids to determine the highest bid among all the priority right sections.This search may be performed expeditiously if in step 49 of FIG. 4 thebid rank of each received bid is determined relative to all other bidsreceived in the auction. Therefore, in the main auction database of FIG.5, the “RANK” field of the highest overall bid received in the auctionwould contain a “1”, the “RANK” field of the second highest overall bidreceived in the auction would contain a “2”, and so on.

Referring again to FIG. 20, in step 428, after the central computer 12has determined which bid is the highest, the priority right designatedin that bid's bid information record is assigned to that bid. Thisprocess is completed by indexing the corresponding bid record in themain auction database of FIG. 5 to the corresponding priority rightrecord in the priority right database of FIG. 6. In step 430, thecentral computer 12 determines whether any priority rights are stillavailable for auction. If the answer is negative, the central computer12 determines if any bids have been bumped, step 432, and then exits thesorting algorithm, step 434. If any priority rights are still availablefor auction, the central computer 12 determines whether any bids haveyet to be processed in step 436. If not, the algorithm proceeds to step432. If there are remaining bids to be processed, the central computer12 conducts another query to determine which bid is the next highestoverall bid, step 438. The central computer 12 then assigns to that bidthe priority right designated in that bid's bid information record. Ifthe priority right designated in that bid information record has alreadybeen assigned to a higher bid, then the available priority right that isthe closest to the designated priority right is assigned. Afterassigning a priority right to the bid, the algorithm returns to step430. The process is continued until all available priority rights havebeen assigned or until all bids have been processed, whichever occursfirst. The algorithm illustrated in FIG. 20 is simply one of variousalgorithms that permit the priority right auctioning system of thepresent invention to sort unranked priority rights so as to obtain forthose rights their true market value.

FIG. 21 illustrates an auction for the right to begin a round of golf ata particular time that is conducted using the automated priority rightauctioning system of the current invention with the sorting algorithm ofFIG. 20. Frame 440 in FIG. 21 contains the bids received during theauction. In this auction, participants were permitted to designate oneof four golf tee times: 8:00 a.m., 8:30 a.m., 9:00 a.m., and 9:30 a.m.The central computer 12 then utilized the sorting algorithm in FIG. 20to assign twenty-seven available tee times to the highest of these bids.

First, the central computer 12, in step 428, determined that priorityright bid 442 for $300 was the highest of all the bids received.Therefore, that bid was assigned the priority right to tee off at 8:00a.m., and the bid record corresponding to bid 442 in the main auctiondatabase of FIG. 5 was indexed to the priority right recordcorresponding to the 8:00 a.m. tee-off time in the priority rightdatabase of FIG. 6. The result of this assignment can be seen in frame444 of FIG. 21.

The central computer 12 then determined that there were more availablepriority rights, step 430, and that there remained bids that had not yetbeen processed, step 436. Therefore, the central computer 12 queried themain auction database of FIG. 5 to determine that priority right bid 446for $260 was the highest unprocessed bid. The central computer 12 thusassigned the priority right to tee off at 8:30 a.m. and indexed the bidrecord corresponding to bid 446 in the main auction database of FIG. 5to the priority right record corresponding to the 8:30 a.m. tee-off timein the priority right database of FIG. 6. The result of this assignmentcan be seen in frame 444 of FIG. 21.

Returning to step 430 in FIG. 20, the central computer 12 determinedthat there were more priority rights available and, in step 436, thatmore unprocessed bids existed. So, in step 438, the central computer 12queried the main auction database of FIG. 5 to discover that the highestunprocessed bid was bid 448 for $250. However, because bid 448designated 8:00 a.m. as its desired priority right and bid 442 hadalready been assigned the 8:00 a.m. priority right, the central computer12 assigned to bid 448 the available priority right closest to the 8:00a.m. priority right, the 8:05 a.m. priority right. The central computer12 then indexed the bid record corresponding to bid 448 in the mainauction database of FIG. 5 to the priority right record corresponding tothe 8:05 a.m. tee-off time in the priority right database of FIG. 6. Theresult of this assignment can be seen in frame 444 of FIG. 21.

The central computer 12 continued processing this algorithm until allpriority rights were assigned to received bids. The final result of allpriority right assignments can be seen in frame 444. During the processof assigning priority rights, if a desired priority right was alreadyassigned the central computer 12 then selected the closest availablepriority right to the desired priority right. Other embodiments of thisinvention may vary this selection, opting to only choose priority rightsin one direction, e.g. later tee times. Additionally, the priorityrights auctioning system could be modified to permit, as discussedabove, alternative priority right bids, personal priority right biddingsections, and participant preference options, such as the option todesignate which direction the bid is bumped. The priority rightsauctioning system of the present invention, utilizing a sortingalgorithm such as that illustrated in FIG. 20, is thus capable ofobtaining the true market value of priority rights that have relativevalues that are difficult to rank prior to their sale.

Statistical Analysis of Auctioning System

The automated priority right auctioning system of the present inventionmay be used in connection with other computer programs to create graphsand tables to enable real-time statistical analysis of the auction. FIG.22 through FIG. 27 are examples of such graphs and tables for a ticketauction. FIG. 22 is a graph of the gross revenue of the auction versusthe time over which the auction takes place. It displays the dollaramount that the auction organizer must obtain to break even, elevenmillion dollars in this example, and the time at which the gross revenuereaches that amount 450. A legend 452 is included in FIG. 22 whichdenotes that each of the points on the graph labeled A through H showsthe gross revenue at the exact time that a section was filled. Thesection of the graph labeled II, i.e. between dotted line 454 and dottedline 456, displays how the rate of increase of the gross revenuedecreases as the auction nears its end.

FIG. 23 is also a graph of the gross revenue of the auction versus thetime over which the auction takes place. FIG. 23 denotes the duration ofmultimedia presentations on the Internet website affiliated with theauction and their effect on the gross revenue. Other information mayalso be placed on the graph. For example, dotted line 500 may denote thetime at which ticket lock-ins become available, and dotted line 502 maydenote the time at which a promotional commercial airs on a local radiostation.

FIG. 24 is the graph of FIG. 22 with an additional graph 550 below itdisplaying the change in the rate of growth of the gross revenue perminute of the auction. Thus, the auction organizer can assess not onlythe effect of each promotional activity upon the total gross revenue butalso its effect on the rate of growth of the revenue.

FIG. 25 is the graph of FIG. 22 with an additional graph 600 below it ofthe number of lock-ins ordered and the amount of the lock-in premiumversus the time over which the auction takes place. Lines 602 and 604 inFIG. 25 display the changes in the level of the lock-in premiums overthe term of the auction. Prior to the time denoted by dotted line 606 inFIG. 25, no lock-in premiums were available. Lines 608 and 610 displaythe number of lock-ins ordered at different times during the auction.FIG. 25 is useful to an auction organizer because it enables theorganizer to analyze the effect of the timing and magnitude of thechanges to the lock-in premium on the number of lock-ins ordered.

FIG. 26 is a graph of the average price per ticket versus the time overwhich the auction takes place. Dotted line 650 denotes the time at whichthis graph was created, 10:09 a.m., and separates the graph into a partthat is based on actual sales and a part that consists of average priceforecasts based upon those actual sales. Dotted line 652 marks the endof the auction, and all lines in the graph that intersect with dottedline 652 are projections of the average price of tickets at the end ofthe auction. For example, line 654 plots the average price of a seat inSection A in an auction for the right to sit in a seat at an event. Asof 10:09 a.m. the average price of a seat in Section A is about $400. Aforecasting algorithm has predicted with 95% certainty, based on therate of growth of the average sale price of a seat in Section A from thestart of the auction until 10:09 a.m., that the price of the averageseat in Section A at the end of the auction will not be below $650. Thealgorithm calculates that to obtain this amount for a ticket at 10:09a.m., the lock-in premium should be set at 40%. Likewise, theforecasting algorithm has predicted with a 50% certainty that the finalaverage price will not be below $1050 and has calculated its relatedlock-in premium of 125%. The forecasting algorithm has also predictedwith a 5% certainty that the final average price will not be below $1850and has calculated the related lock-in premium of 300%. The auctionorganizer may use graphs such as FIG. 26 throughout an auction todetermine a reasonable lock-in premium amount.

FIG. 27 contains two graphs displaying real-time ticket sale stats foran auction of the rights to sit in a particular seat at an event. Graph700 in FIG. 27 plots the number of bids received per minute during thetime that the auction takes place. In addition, statistics frame 702contains numerical data useful to the auction organizer, including thetotal number of bids received, the total number of bumped bids, theaverage number of seats per bid, and the number of lock-ins ordered.Graph 704 in FIG. 27 plots the distribution of bids at a certain pointof time in the auction. The minimum, maximum, average, and median bidamounts are denoted by label 706, label 708, label 710, and dotted line712, respectively. Additionally, graph 704 distinguishes betweenstanding bids and bumped bids by graphing each in a different color. Theauction organizer may create multiple versions of graph 704 for varioustimes during the auction, enabling the organizer to view the progressionof bids during the auction. Statistics frame 714 contains numerical datasuch as the number of sections filled, the average standing bid amount,the high bid amount, and the low bid amount.

It is to be understood that the above-described embodiments of theinvention are merely illustrative. Other implementations may readily bedevised by those of ordinary skill in the art which will embody theprinciples of the invention and fall within the spirit and scopethereof. For example, the exemplary contiguous ticket algorithm of FIG.12 may readily be modified to allow repeated movements of a group toensure contiguous tickets or to allow block-style groupings, or othervariations. Moreover, this ensuring of contiguous tickets shown at step54 of FIG. 4, could be performed as each bid is placed, rather than onlyat the close of the auction. Likewise, the last ticket cut-off in step55 of FIG. 4 could be executed with each bid made. Additionally, theauction system may readily be modified to sell each section of seats insuccession or at different Internet locations. Other embodiments mayprovide additional incentives for bidders to bid early in the auction.For example, if the auction is for the right to sit in a particular seatat an event, those bidding within the first ten minutes from the auctionopening may be awarded cash value certificates for redemption at theevent for concessions or gift shop items. Larger awards may be grantedfor earlier bids (e.g., $10 for a bid within the first ten minutes afterauction opening) and smaller awards may be granted for later bids (e.g.,$2 for a bid within the first hour after auction opening). In otheralternative embodiments, certain classes of people may be awardedpreferential treatment during bidding. For example, alumni bids may beaugmented by a given dollar amount, alumni may given access to a certainportion of the tickets, or alumni may be allowed to place bids after theauction closes. In any event, although auctions for priority rights suchas event tickets and golf tee times have been used in the abovedescription, the invention is not limited to systems auctioning thosepriority rights, and the system may be designed to auction any number ofdifferent types of priority rights.

1-9. (canceled)
 10. A method for distributing a plurality of priorityrights, the method comprising: receiving a plurality of bid records froma plurality of users, the bid records including bid amount data and bidquantity data; correlating a selected bid record received from aselected user with a subset of priority rights, wherein (a) the subsetof priority rights is selected from the plurality of priority rights atleast partially based on the selected bid record bid amount data, and(b) the subset of priority rights includes a quantity of priority rightsthat corresponds to the selected bid record bid quantity data; anddistributing the subset of priority rights to the selected user.
 11. Themethod of claim 10, wherein the subset of priority rights consists ofone priority right.
 12. The method of claim 10, further comprisingreceiving registration information from the selected user beforereceiving the selected bid record from the selected user.
 13. The methodof claim 10, wherein at least a portion of the plurality of bid recordsare received via the Internet.
 14. The method of claim 10, wherein theplurality of priority rights corresponds to a plurality of eventtickets.
 15. The method of claim 10, wherein n equals the quantity ofpriority rights, the method further comprising: ranking n of thereceived bid records based on the bid record bid amount data, such thatthe selected bid record has a corresponding selected bid record rank;and ranking the plurality of priority rights according to apredetermined preference, such that the subset of priority rights has acorresponding subset rank, wherein the selected bid record is correlatedwith the subset of priority rights such that the subset rank correspondsto the selected bid record rank.
 16. The method of claim 10, furthercomprising comparing the selected bid record bid amount data with aminimum bid threshold and with a maximum authorization threshold. 17.The method of claim 10, further comprising sending a bid statusnotification to the selected user. 18-41. (canceled)
 42. A method ofallocating tickets via an auction, comprising transmitting from acomputer over a network an auction start date to one or more userterminals before the start date; transmitting from the computer to atleast one user terminal a graphical representation of seating for afirst venue at which an event is to take place for which tickets arebeing auctioned, wherein the first venue includes a plurality of seatingsections; transmitting to at least one user terminal minimum bidinformation for the auction; receiving at the computer bid informationfrom at least one user terminal, the bid information including bid priceinformation; determining if the bid price is unacceptable or acceptablebased at least in part on the minimum bid; and delivering a ticket to asuccessful bidder.
 43. The method as defined in claim 42, wherein atleast one venue seating section includes a plurality of seats.
 44. Themethod as defined in claim 42, wherein only one seat is available at afirst bid level.
 45. The method as defined in claim 42, the methodfurther comprising transmitting over the network a bid web page form toat least one user terminal.
 46. The method as defined in claim 42, themethod further comprising transmitting over the network an html bid webpage form to at least one user terminal.
 47. The method as defined inclaim 42, the method further comprising initiating an auction site inadvance of open bidding.
 48. The method as defined in claim 42, themethod further comprising receiving over a network user registrationinformation.
 49. The method as defined in claim 42, wherein the bidinformation includes section identification information.
 50. The methodas defined in claim 42, wherein the bid information includes seatquantity information.
 51. The method as defined in claim 42, the methodfurther comprising receiving credit card information over the networkfrom at least one auction participant prior to accepting a first bidfrom the at least one auction participant.
 52. The method as defined inclaim 42, the method further comprising transmitting a message over thenetwork to a first user indicating that the first user needs to registerin order to bid.
 53. The method as defined in claim 42, the methodfurther comprising transmitting a message over the network to a firstuser indicating that a bid from the first user is too low to be awinning bid.
 54. The method as defined in claim 42, the method furthercomprising transmitting a message over the network to a first userindicating that a bid from the first user is accepted.
 55. The method asdefined in claim 42, the method further comprising transmittinginformation regarding a current standing bid for at least one seat overthe network to a first user.
 56. The method as defined in claim 42, themethod further comprising transmitting updated information regarding astanding bid for at least one seat over the network to a first user. 57.The method as defined in claim 42, the method further comprisingtransmitting a performer name, a performance date, and a performancetime to at least one user terminal.
 58. The method as defined in claim42, the method further comprising transmitting an auction start time toat least one user terminal prior to the start of the auction.
 59. Themethod as defined in claim 42, the method further comprisingtransmitting an indication to at least one user terminal that bids mustbe in whole dollars.
 60. The method as defined in claim 42, the methodfurther comprising storing in a computer database name, addressinformation, and credit card information for a plurality of ticketauction participants.
 61. A method of auctioning tickets, the methodcomprising: transmitting over a network a ticket auction start date toone or more user terminals; transmitting over the network minimum bidinformation to one or more user terminals; receiving over the network aplurality of ticket bids from a plurality of user terminals; identifyingat least a first successful ticket auction bidder; and transmitting anotification over the network to a terminal associated with the firstsuccessful auction bidder.
 62. The method as defined in claim 61,transmitting to at least one user terminal a graphical representation ofseating for a venue, wherein tickets are being auctioned for an event atthe venue.
 63. The method as defined in claim 61, wherein only one seatis available at a first bid level.
 64. The method as defined in claim61, the method further comprising transmitting over the network a bidweb page form to at least one user terminal.
 65. The method as definedin claim 61, the method further comprising transmitting over the networkan html bid web page form to at least one user terminal.
 66. The methodas defined in claim 61, the method further comprising initiating anauction site for the auction in advance of open bidding for the auction.67. The method as defined in claim 61, the method further comprisingreceiving over a network user registration information.
 68. The methodas defined in claim 61, wherein at least one bid includes sectionidentification information.
 69. The method as defined in claim 61,wherein at least one bid includes seat quantity information.
 70. Themethod as defined in claim 61, the method further comprising receivingcredit card information over the network from at least one auctionparticipant prior to accepting a first bid from the at least one auctionparticipant.
 71. The method as defined in claim 61, the method furthercomprising transmitting a message over the network to a first userindicating that the first user needs to register in order to bid. 72.The method as defined in claim 61, the method further comprisingtransmitting a message over the network to a first user indicating thata bid from the first user is too low to be a winning bid.
 73. The methodas defined in claim 61, the method further comprising transmitting amessage over the network to a first user indicating that a bid from thefirst user is accepted.
 74. The method as defined in claim 61, themethod further comprising transmitting information regarding a currentstanding bid for at least one seat over the network to a first user. 75.The method as defined in claim 61, the method further comprisingtransmitting updated information regarding a standing bid for at leastone seat over the network to a first user.
 76. The method as defined inclaim 61, the method further comprising transmitting a performer name, aperformance date, and a performance time to at least one user terminal.77. The method as defined in claim 61, the method further comprisingtransmitting an indication to at least one user terminal that bids mustbe in whole dollars.
 78. The method as defined in claim 61, the methodfurther comprising storing seat section data.
 79. The method as definedin claim 61, the method further comprising storing in a computerdatabase name, address information, and credit card information for aplurality of ticket auction participants. 80-89. (canceled)